We report the results of a computational study of repacking in the FCCIncentive Auctions. Our interest lies in the structure and constraints of thesolution space of feasible repackings. Our analyses are "mechanism-free", inthe sense that they identify constraints that must hold regardless of thereverse auction mechanism chosen or the prices offered for broadcasterclearing. We examine topics such as the amount of spectrum that can be clearednationwide, the geographic distribution of broadcaster clearings required toreach a clearing target, and the likelihood of reaching clearing targets undervarious models for broadcaster participation. Our study uses FCC interferencedata and a satisfiability-checking approach, and elucidates both theunavoidable mathematical constraints on solutions imposed by interference, aswell as additional constraints imposed by assumptions on the participationdecisions of broadcasters.
展开▼
